Abstract:

The achievable rates of coded cooperative OFDMA systems were analyzed and their upper bound expressions were derived. Based on the expressions, an adaptive subcarrier searching allocation algorithm was proposed on the principle of maximization the minimum of users’ achievable rates. This algorithm starts with the greedy algorithm and optimizes subcarrier allocation by iterating. Simulation results show that the proposed searching algorithm can improve greatly the achievable rates, balance the performance of users and run quickly which could satisfy the real time application.

Key words: coded cooperation, orthogonal frequency division multiple access, subcarrier allocation